Multi-Valued and Probabilistic Argumentation Frameworks
نویسنده
چکیده
In this paper we further progress the analysis of the recently introduced multi-valued argumentation frameworks ( ). are an extension of Dung’s abstract argumentation, where arguments have a degree of truth associated with them. Here we describe a list of properties of considering the major multi-valued logics such as those proposed by Gödel, Zadeh and Łukasiewicz. We then propose a computational framework that joins multi-valued and probabilistic argumentation frameworks to handle situations where arguments affected by vagueness and/or probabilities coexist. The findings are a contribution to the field of non-monotonic approximate reasoning and they also represent a well-grounded proposal towards the introduction of gradualism in argumentation systems.
منابع مشابه
Probabilistic Argumentation for Decision Making A Toolbox and Applications
Argumentation frameworks developed in AI have greatly eased the developments of many kinds of intelligent systems. Recently, to deal with quantitative uncertainties, several authors integrate probabilities into such frameworks to propose probabilistic argumentation frameworks. However, the developments of intelligent systems using these new frameworks are still hindered by the lack of programmi...
متن کاملOn the Relative Expressiveness of Argumentation Frameworks, Normal Logic Programs and Abstract Dialectical Frameworks
We analyse the expressiveness of the two-valued semantics of abstract argumentation frameworks, normal logic programsargumentation frameworks, normal logic programs and abstract dialectical frameworks. By expressiveness we mean the ability to encode a desired set of two-valued interpretations over a given propositional signature using only atoms from that signature. While the computational comp...
متن کاملMulti-valued Argumentation Frameworks
In this paper we explore how the seminal Dung’s abstract argumentation framework can be extended to handle arguments containing gradual concepts. We allow arguments to have a degree of truth associated with them and we investigate the degree of truth to which each argument can be considered accepted, rejected and undecided by an abstract argumentation semantics. We propose a truth-compositional...
متن کاملTheory of multiple-valued defeasible argumentation and its applications
This paper provides a new departure from the traditional twovalued argumentation frameworks. We address ourselves to formalize an expressive logic of argumentation, called a Logic of Multiple-valued Argumentation (LMA), on top of the very expressive knowledge representation language, called Extended Annotated Logic Programming (EALP), and examine its logical properties in various ways. EALP all...
متن کاملToward a Computational Analysis of Probabilistic Argumentation Frameworks
In this paper we analyze probabilistic argumentation frameworks (PAFs), defined as an extension of Dung abstract argumentation frameworks in which each argument is asserted with a probability . The debate around PAFs has so far centered on their theoretical definition and basic properties. This work contributes to their computational analysis by proposing a first recursive algorithm to compute ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014